q-ary Compressive Sensing
نویسندگان
چکیده
We introduce q-ary compressive sensing, an extension of 1-bit compressive sensing. We propose a novel sensing mechanism and a corresponding recovery procedure. The recovery properties of the proposed approach are analyzed both theoretically and empirically. Results in 1-bit compressive sensing are recovered as a special case. Our theoretical results suggest a tradeoff between the quantization parameter q, and the number of measurements m in the control of the error of the resulting recovery algorithm, as well its robustness to noise.
منابع مشابه
Half-Quadratic Algorithm for ℓp - ℓq Problems with Applications to TV-ℓ1 Image Restoration and Compressive Sensing
In this paper, we consider the `p-`q minimization problem with 0 < p, q ≤ 2. The problem has been studied extensively in image restoration and compressive sensing. In the paper, we first extend the half-quadratic technique from `1-norm to `p-norm with 0 < p < 2. Based on this, we develop a half-quadratic algorithm to solve the `p-`q problem. We prove that our algorithm is indeed a majorize-mini...
متن کاملData Acquisition and Processing of Parallel Frequency Sar Based on Compressive Sensing
Traditional synthetic aperture radar (SAR) utilizes Shannon-Nyquist theorem for high bandwidth signal sampling, which induces a complicated SAR system, and it is difficult to transmit and process a huge amount of data caused by high A/D rate. Compressive sensing (CS) indicates that the compressible signal using a few measurements can be reconstructed by solving a convex optimization problem. A ...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملDimensionality reduction via compressive sensing
0167-8655/$ see front matter 2012 Elsevier B.V. A doi:10.1016/j.patrec.2012.02.007 q This work is partially supported by Charles S Research Grant OPA 4818. 1 NICTA is funded by the Australian Government as re of Broadband, Communications and the Digital Econom Council through the ICT Centre of Excellence program. ⇑ Corresponding author. E-mail addresses: [email protected] (J. Gao), q Tiberio.Cae...
متن کاملOn reducibility of n-ary quasigroups, II
An n-ary operation Q : Σ → Σ is called an n-ary quasigroup of order |Σ| if in the equation x0 = Q(x1, . . . , xn) knowledge of any n elements of x0, . . . , xn uniquely specifies the remaining one. Q is permutably reducible ifQ(x1, . . . , xn) = P ` R(xσ(1), . . . , xσ(k)), xσ(k+1), . . . , xσ(n) ́ where P and R are (n − k + 1)-ary and k-ary quasigroups, σ is a permutation, and 1 < k < n. An m-a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1302.5168 شماره
صفحات -
تاریخ انتشار 2013